Efficiency of Server Task Queueing for Dynamic Load Balancing

نویسندگان

  • Wolfgang Becker
  • Rainer Pollak
چکیده

In this paper we investigate optimal points of time for task assignment in dynamic load balancing schemes. Normally final assignment of tasks to server queues is made at the latest possible time. The main reason for a late assignment is, that a dynamic load balancer can use most recent information about system and application state for the decision. In general however, assignment can be done at task arrival time, at the moment when a processor or server becomes idle, or when significant load changes in the system occur. We will elaborate preconditions and circumstances for situations, where it is advantageous to assign tasks earlier than necessary, i.e. to queue them at the servers. We verify the results in an experimental load balancing environment.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Load Balancing Approaches for Web Servers: A Survey of Recent Trends

Numerous works has been done for load balancing of web servers in grid environment. Reason behinds popularity of grid environment is to allow accessing distributed resources which are located at remote locations. For effective utilization, load must be balanced among all resources. Importance of load balancing is discussed by distinguishing the system between without load balancing and with loa...

متن کامل

A 2 Level Dynamic Scheduling Method for Real Time Tasks on Homogeneous Distributed System

A distributed system is a collection of independent computers that appears to its users as a single coherent system. Depending on job arrival rate some of the computing nodes may become overloaded while some other nodes may sit idle. The imbalance in load distribution may affect overall system performance. So proper task scheduling algorithm is needed. Real time task scheduling algorithm must t...

متن کامل

Boosting the Throughput of a Multi-server System via Adaptive Task Replication

The throughput (rate of task completion) of a multi-server system is typically the sum of the service rates of individual servers. In this paper we demonstrate how task replication can result in a higher throughput, and we seek to find the fundamental limit of this throughput boost. Several recent works have studied queueing systems where tasks are replicated at multiple servers, and the copies...

متن کامل

Web Delay Analysis and Reduction by Use of Load Balancing of a Dispatcher-based Web Server Cluster

The loading of web servers can be very heavy and a delay in accessing certain Web sites can be substantial. Hence, the reduction of web delay is one of the important topics of research for improving the quality of service of Web pages. Thus, in this paper, we propose the web delay analysis and the web delay reduction by using load balancing coupled with the dispatcher-based approach. First, we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994